Faulty Group Protocols
نویسنده
چکیده
A group protocol is a protocol whereby the group participants securely exchange information in order to achieve a common goal or application, e.g. agreeing on a contract or on a session key. Groups are typically dynamic and relatively small in size, of the order of a hundred members [2]. To enable dynamic changes to group constitution, a group protocol may be defined by several sub-protocols for joining and leaving, and may appeal to a trusted third party, called the server for short. The design of a group protocol may address several requirements, including efficiency (e.g., the crypt-algorithm used, the number of messages exchanged), security guarantee (e.g., implicit key agreement, exchange fairness) the type of channel (private, public), the group topology (e.g., ring), the communication technology (e.g., wired, wireless), the scheme used in key generation (centralised, distributed), the level of involvement of the server, if any (e.g., online or offline), the communication paradigm (e.g., RPC, connection-oriented) and trust hierarchy. Thus, a protocol may be correct in some scenarios but not in others. Similarly, an attack may be valid in some scenarios but not in others. In what follows, we overview the several faulty group protocols from the literature. Protocols will be given by a sequence of steps, each of the form:
منابع مشابه
Group Communication: Helping or Obscuring Failure Diagnosis?
Replicated client-server systems are often based on underlying group communication protocols that provide totally ordered, reliable delivery of messages. However, in the face of a performance fault (e.g, memory leak, packet loss) at a single node, group communication protocols can cause correlated performance degradations at non-faulty nodes. We explore the impact of performance-degradation fau...
متن کاملGroup Communication: Helping or Obscuring Failure Diagnosis? (CMU-PDL-06-107)
Replicated client-server systems are often based on underlying group communication protocols that provide totally ordered, reliable delivery of messages. However, in the face of a performance fault (e.g, memory leak, packet loss) at a single node, group communication protocols can cause correlated performance degradations at non-faulty nodes. We explore the impact of performance-degradation fau...
متن کاملA Method for Patching Interleaving-Replay Attacks in Faulty Security Protocols
The verification of security protocols has attracted a lot of interest in the formal methods community, yielding two main verification approaches: i) state exploration, e.g. FDR [8] and OFMC [2]; and ii) theorem proving, e.g. the Isabelle inductive method [12] and Coral [13]. Complementing formal methods, Abadi and Needham’s principles aim to guide the design of security protocols in order to m...
متن کاملPartially Authenticated Algorithms for Byzantine Agreement
Byzantine agreement is a fundamental issue in fault-tolerant and secure distributed computing. Protocols solving Byzantine agreement guarantee that a sender can transmit a value to a group of receivers consistently, even if some of the nodes, including the sender, are arbitrarily faulty. In the past, protocols for Byzantine agreement were generally either authenticated or non-authenticated. Non...
متن کاملReliable Synchronization Support and Group-Membership Services for Distributed Multimedia Applications
In this paper we propose a communication software architecture designed to support distributed multimedia applications. In particular, we describe algorithms and protocols that implement reliable synchronization support and group-membership services for those applications. We show that these protocols provide all the non faulty application components with a consistent view of the group membersh...
متن کامل